Termination w.r.t. Q proof of TRS/higher-order/LifantsevEx9Maps.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map_1, f), app(app(cons, h), t)) → app(app(cons, app(f, h)), app(app(map_1, f), t))
app(app(app(map_2, f), c), app(app(cons, h), t)) → app(app(cons, app(app(f, h), c)), app(app(app(map_2, f), c), t))
app(app(app(app(map_3, f), g), c), app(app(cons, h), t)) → app(app(cons, app(app(app(f, g), h), c)), app(app(app(app(map_3, f), g), c), t))

Q is empty.

↳ QTRS

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map_1, f), app(app(cons, h), t)) → app(app(cons, app(f, h)), app(app(map_1, f), t))
app(app(app(map_2, f), c), app(app(cons, h), t)) → app(app(cons, app(app(f, h), c)), app(app(app(map_2, f), c), t))
app(app(app(app(map_3, f), g), c), app(app(cons, h), t)) → app(app(cons, app(app(app(f, g), h), c)), app(app(app(app(map_3, f), g), c), t))

Q is empty.